Empirical Probabilities in Monadic Deductive Databases

نویسندگان

  • Raymond T. Ng
  • V. S. Subrahmanian
چکیده

We address the problem of supporting empir­ ical probabilities in monadic logic databases. Though the semantics of multivalued logic programs has been studied extensively, the treatment of probabilities as results of sta­ tistical findings has not been studied in logic programming/deductive databases. We de­ velop a model-theoretic characterization of logic databases that facilitates such a treat­ ment. We present an algorithm for checking consistency of such databases and prove its total correctness. We develop a sound and complete query processing procedure for han­ dling queries to such databases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantics, Consistency, and Query Processing of Empirical Deductive Databases

In recent years, there has been growing interest in reasoning with uncertainty in logic programming and deductive databases. However, most frameworks proposed thus far are either non-probabilistic in nature or based on subjective probabilities. In this paper, we address the problem of incorporating empirical probabilities { that is, probabilities obtained from statistical ndings { in deductive ...

متن کامل

Rapport de stage de recherche Complexity of Decision Problems in Computational Logic RAPPORT NON CONFIDENTIEL

This report presents the study of algorithms whose goal is to determine whether two Datalog programs are equivalent. Datalog is a query language used over deductive databases. Datalog is a fragment of Prolog, and consists in Horn clauses without function symbols. In general, it is undecidable whether two given Datalog programs are equivalent one to each other; however, this problem becomes deci...

متن کامل

OWL Support for (Some) Non-Deductive Scenarios of Ontology Usage

Applications of ontologies exist that go beyond standard deductive reasoning and rather have the character of empirical discovery in knowledge/data. We analyse the inventory of OWL with respect to two such applications, namely to pattern-based ontology matching and to ontology-aware knowledge discovery from databases.

متن کامل

Monadic Second Order Probabilities in Algebra

We analyze the question of existence of asymptotic cumulative probabilities for monadic second order deenable properties of nite algebras. We focus our attention on the directly representable varieties and on the variety of groups. We prove in a very strong way that some recently proven rst-order 0{1 laws and limit laws for these varieties cannot be extended to monadic second order logic. Namel...

متن کامل

Deductive Databases with Universally Quantified Conditions

This paper presents an extension to deductive databases, called quantified deductive databases, that incorporates universally quantified expressions (in coded form) in the body of rules. Since universally quantified expressions contain negations in their semantics, quantified deductive databases fall under the category of deductive databases with negation. Furthermore, depending on other factor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992